import math
t = int(input())
while t != 0:
n = int(input())
g = mx = 0
arr = list(map(int, input().split()))
for i in range(n):
g = math.gcd(g, arr[i])
mx = arr[n - 1] // g
print(mx)
t -= 1#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
int n, a[100010], cnt[100010];
void solve()
{
cin >> n;
int g = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
g = __gcd(a[i], g);
}
cout << a[n] / g << endl;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int T = 1;
cin >> T;
while (T--) {
solve();
}
return 0;
}
1609C - Complex Market Analysis | 1657E - Star MST |
1143B - Nirvana | 1285A - Mezo Playing Zoma |
919B - Perfect Number | 894A - QAQ |
1551A - Polycarp and Coins | 313A - Ilya and Bank Account |
1469A - Regular Bracket Sequence | 919C - Seat Arrangements |
1634A - Reverse and Concatenate | 1619C - Wrong Addition |
1437A - Marketing Scheme | 1473B - String LCM |
1374A - Required Remainder | 1265E - Beautiful Mirrors |
1296A - Array with Odd Sum | 1385A - Three Pairwise Maximums |
911A - Nearest Minimums | 102B - Sum of Digits |
707A - Brain's Photos | 1331B - Limericks |
305B - Continued Fractions | 1165B - Polycarp Training |
1646C - Factorials and Powers of Two | 596A - Wilbur and Swimming Pool |
1462B - Last Year's Substring | 1608B - Build the Permutation |
1505A - Is it rated - 2 | 169A - Chores |